Computational Intelligence Routing for Lifetime Maximization in Heterogeneous Wireless Sensor Networks
نویسنده
چکیده
In wireless sensor networks, sensor nodes are typically powerconstrained with limited lifetime, and thus it is necessary to know how long the network sustains its networking operations. Heterogeneous WSNs consists of different sensor devices with different capabilities. One of major issue in WSNs is finding the coverage distance and connectivity between sensors and sink. To increase the network lifetime, this paper proposed Swarm Intelligence, routing technique called Ant Colony Optimization (ACO). Ant colony optimization algorithm provides a natural and intrinsic way of exploration of search space of coverage area. Ants communicate with their nest-mates using chemical scents known as pheromones, Based on Pheromone trail between sensor devices the shortest path is found. By finding the coverage distance and sensing range, the network lifetime maximized and reduces the energy usage. Extensive Java Agent Framework (JADE) multi agent simulator result clearly provides more approximate, effective and efficient way for maximizing the lifetime of heterogeneous WSNs. Index Terms wireless sensor networks (WSNs), Ant colony optimization (ACO), connectivity, coverage, network lifetime.
منابع مشابه
Multicast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملA Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملHYREP: A Hybrid Low-Power Protocol for Wireless Sensor Networks
In this paper, a new hybrid routing protocol is presented for low power Wireless Sensor Networks (WSNs). The new system uses an integrated piezoelectric energy harvester to increase the network lifetime. Power dissipation is one of the most important factors affecting lifetime of a WSN. An innovative cluster head selection technique using Cuckoo optimization algorithm has been used in the desig...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کامل